Efficient path-based computations on pedigree graphs with compact encodings
نویسندگان
چکیده
منابع مشابه
Efficient All Path Score Computations on Grid Graphs
We study the Integer-weighted Grid All Paths Scores (IGAPS) problem, which is given a grid graph, to compute the maximum weights of paths between every pair of a vertex on the first row of the graph and a vertex on the last row of the graph. We also consider a variant of this problem, periodic IGAPS, where the input grid graph is periodic and infinite. For these problems, we consider both the g...
متن کاملComparing Unlabeled Pedigree Graphs via Covering with Bipartite and Path
Family trees, also called pedigrees, have important information about an individual's past and future life. It can be used as a diagnostic tool and help guide decisions about genetic testing for the patient and at-risk family members. There are 2% to 10% of parent-child relationships missing, and this can cause large differences in the pedigree graphs created. Hence, the evaluation of pedigrees...
متن کاملEfficient Computations of Encodings for Quantum Error Correction
We show how, given any set of generators of the stabilizer of a quantum code, an efficient gate array that computes the codewords can be constructed. For an n-qubit code whose stabilizer has d generators, the resulting gate array consists of O(nd) operations, and converts k-qubit data (where k = n − d) into n-qubit codewords. 02.70.Rw, 03.65.Bz, 89.80.+h Typeset using REVTEX ∗[email protected]...
متن کاملShortest Path Computations in Source-Deplanarized Graphs
We consider a class of non-planar graphs that arises in VLSI layout compaction and show that a numuer of shortest path problems on these graphs can be solved in the same time as the corresponding problem in a planar graph.
متن کاملShortest Path Computations in S-Graphs
We consider a class of non-planar graphs that arises in VLSI layout compaction and show that a number of shortest path problems on these graphs can be solved in the same time as the corresponding problem in a planar graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2012
ISSN: 1471-2105
DOI: 10.1186/1471-2105-13-s3-s14